Current Studies and Applications of Shuffled Frog Leaping Algorithm: A Review

نویسندگان

چکیده

Shuffled Frog Leaping Algorithm (SFLA) is one of the most widespread algorithms. It was developed by Eusuff and Lansey in 2006. SFLA a population-based metaheuristic algorithm that combines benefits memetics with particle swarm optimization. has been used various areas, especially engineering problems due to its implementation easiness limited variables. Many improvements have made alleviate drawbacks, whether they were achieved through modifications or hybridizations other well-known This paper reviews relevant works on this algorithm. An overview first conducted, followed algorithm's recent hybridizations. Next, applications are discussed. Then, an operational framework SLFA variants proposed analyze their uses different cohorts applications. Finally, future suggested. The main incentive conduct survey provide useful information about researchers interested working enhancement application.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Centroid Mutation Embedded Shuffled Frog-Leaping Algorithm

Stochastic search algorithms that take their inspiration from nature are gaining a great attention of many researchers to solve high dimension and non – linear complex optimization problems for which traditional methods fails. Shuffled frog – leaping algorithm (SFLA) is recent addition to the family of stochastic search algorithms that take its inspiration from the foraging process of frogs. SF...

متن کامل

An Improved Shuffled Frog Leaping Algorithm ⋆

In order to overcome the defects of Shuffled Frog Leaping Algorithm (SFLA) such as nonuniform initial population, slow searching speed in the late evolution and easily trapping into local extremum, a new Shuffled Frog Leaping Algorithm based on mutation operator and population diversity is proposed in this paper. The algorithm has overcome the disadvantage mentioned above. The algorithm efficie...

متن کامل

Two-Phases Learning Shuffled Frog Leaping Algorithm

In order to overcome the drawbacks of standard shuffled frog leaping algorithm that converges slowly at the last stage and easily falls into local minima, this paper proposed two-phases learning shuffled frog leaping algorithm. The modified algorithm added the elite Gaussian learning strategy in the global information exchange phase, updated frog leaping rule and added the learning capability t...

متن کامل

Voltage Flicker Parameters Estimation Using Shuffled Frog Leaping Algorithm and Imperialistic Competitive Algorithm

Measurement of magnitude and frequency of the voltage flicker is very important for monitoring andcontrolling voltage flicker efficiently to improve the network power quality. This paper presents twonew methods for measurement of flicker signal parameters using Shuffled Frog Leaping Algorithm(SFLA) and Imperialist Competitive Algorithm (ICA). This paper estimates fundamental voltage andflicker ...

متن کامل

Economic Emission Load Dispatch by Modified Shuffled Frog Leaping Algorithm

This paper presents a newly developed optimization approach involving a modified shuffled frog leaping algorithm (MSFLA) applied for the solution of the economic emission load dispatch (EELD) problem. The approach utilizes the local search strategies for searching global solution. MSFLA is developed on the same frame work of shuffled frog leaping algorithm (SFLA). In this proposed algorithm, a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Archives of Computational Methods in Engineering

سال: 2022

ISSN: ['1886-1784', '1134-3060']

DOI: https://doi.org/10.1007/s11831-021-09707-2